An Efficient Algorithm for Rendering Large Bodies of Water
نویسندگان
چکیده
Water rendering is one of the most computationally demanding task in computer graphics. Because of its computational complexity, real-time water rendering requires high-end hardwares. In this paper, we present a new algorithm for real-time rendering of large bodies of water such as open seas and oceans which results in an improved efficiency. Using interactive frustum, water surface can be fluidly calculated as a function of height given and interaction with another player in games. This results in an efficient yet realistic method for rendering large bodies of water without requiring as much computational power.
منابع مشابه
CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...
متن کاملCHARGED SYSTEM SEARCH FOR OPTIMUM DESIGN OF COST-EFFECTIVE STRUCTURAL BEST MANAGEMENT PRACTICES FOR IMPROVING WATER QUALITY
Best Management Practices (BMPs) are implemented in a watershed to reduce the amount of non-point source pollutants transported to water bodies. However, an optimization algorithm is required to choose the efficient type, size, and location of BMPs for application in a watershed for improving the water quality. In this study, the Charged System Search, a well-known and powerful meta-heuristic o...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملCOMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES
Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کامل